Quantitative Stability in the Isodiametric Inequality via the Isoperimetric Inequality
نویسنده
چکیده
The isodiametric inequality is derived from the isoperimetric inequality trough a variational principle, establishing that balls maximize the perimeter among convex sets with fixed diameter. This principle brings also quantitative improvements to the isodiametric inequality, shown to be sharp by explicit nearly optimal sets.
منابع مشابه
Isodiametric and Isoperimetric Inequalities for Complexes and Groups
It is shown that D. Cohen’s inequality bounding the isoperimetric function of a group by the double exponential of its isodiametric function is valid in the more general context of locally finite simply connected complexes. It is shown that in this context this bound is ‘best possible ’. Also studied are seconddimensional isoperimetric functions for groups and complexes. It is shown that the se...
متن کاملIsoperimetric and Isodiametric Functions of Finite Presentations
We survey current work relating to isoperimetric functions and isodiametric functions of finite presentations. §
متن کاملThe Topology of Graph Products of Groups
Given a finite (connected) simplicial graph with groups assigned to the vertices, the graph product of the vertex groups is the free product modulo the relation that adjacent groups commute. The graph product of finitely presented infinite groups is both semistable at infinity and quasi-simply filtrated. Explicit bounds for the isoperimetric inequality and isodiametric inequality for graph prod...
متن کاملA Mass Transportation Approach to Quantitative Isoperimetric Inequalities
A sharp quantitative version of the anisotropic isoperimetric inequality is established, corresponding to a stability estimate for the Wulff shape of a given surface tension energy. This is achieved by exploiting mass transportation theory, especially Gromov’s proof of the isoperimetric inequality and the Brenier-McCann Theorem. A sharp quantitative version of the Brunn-Minkowski inequality for...
متن کاملFunctions on Groups and Computational Complexity
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the computational complexity of the word problem (deterministic time, nondeterministic time, symmetric space). We show that the isoperimetric function can always be linear...
متن کامل